Stanley Decompositions, Pretty Clean Filtrations and Reductions modulo Regular Elements
نویسنده
چکیده
We study the behavior of Stanley decompositions and of pretty clean filtrations under reduction modulo a regular element.
منابع مشابه
Prime Filtrations of Monomial Ideals and Polarizations
We show that all monomial ideals in the polynomial ring in at most 3 variables are pretty clean and that an arbitrary monomial ideal I is pretty clean if and only if its polarization I p is clean. This yields a new characterization of pretty clean monomial ideals in terms of the arithmetic degree, and it also implies that a multicomplex is shellable if and only the simplicial complex correspond...
متن کاملFinite Filtrations of Modules and Shellable Multicomplexes
We introduce pretty clean modules, extending the notion of clean modules by Dress, and show that pretty clean modules are sequentially CohenMacaulay. We also extend a theorem of Dress on shellable simplicial complexes to multicomplexes.
متن کاملStanley Decompositions of Squarefree Modules and Alexander Duality
In this paper we study how prime filtrations and squarefree Stanley decompositions of squarefree modules over the polynomial ring and the exterior algebra behave with respect to Alexander duality.
متن کاملRings in which elements are the sum of an idempotent and a regular element
Let R be an associative ring with unity. An element a in R is said to be r-clean if a = e+r, where e is an idempotent and r is a regular (von Neumann) element in R. If every element of R is r-clean, then R is called an r-clean ring. In this paper, we prove that the concepts of clean ring and r-clean ring are equivalent for abelian rings. Further we prove that if 0 and 1 are the only idempotents...
متن کاملTheorem (in any field of Characteristic 2):
In Graph Theory a number of results were devoted to studying the computational complexity of the number modulo 2 of a graph’s edge set decompositions of various kinds, first of all including its Hamiltonian decompositions, as well as the number modulo 2 of, say, Hamiltonian cycles/paths etc. While the problems of finding a Hamiltonian decomposition and Hamiltonian cycle are NP-complete, countin...
متن کامل